An Efficient Design Approach for a Prime-length Generalized Hartley Transform Systolic Array

نویسندگان

  • D. F. Chiper
  • M. O. Ahmad
چکیده

An efficient approach to the design of a VLSI array for a prime-length type III generalized discrete Hartley transform (GDHT) is presented. The design makes use of an appropriate decomposition of the GDHT into two half-length circular correlation structures having the same length and form that can be concurrently computed and implemented on a single linear systolic array using some of the known hardware sharing techniques. As a consequence, a substantial increase in computational speed with a simplified control structure and low hardware complexity can be achieved, while preserving all the advantages, such as the low I/O and hardware costs, of the circular correlation based VLSI implementations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient systolic solution for a new prime factor discrete Hartley transform algorithm - Circuits, Devices and Systems, IEE Proceedings G

Recently, a novel systolic structure has been proposed for the computation of DFT for transform length N = 4 M , M being prime to 4. In this paper, we have proposed a similar structure for the computation of DHT by prime factor decomposition. A new recursive algorithm is also proposed for computing DHT using a linear systolic array of cordic processing elements. The proposed structure has nearl...

متن کامل

An efficient prime-factor algorithm for the discrete cosine transform and its hardware implementations

The prime-factor decomposition is a fast computational technique for many important digital signal processing operations, such as the convolution, the discrete Fourier transform, the discrete Hartley transform, and the discrete cosine transform (DCT). In this paper, we present a new prime-factor algorithm for the DCT. We also design a prime-factor algorithm for the discrete sine transform which...

متن کامل

Arbitrary-length Fast Hartley Transform without Multiplications

Discrete Hartley transform (DHT) is an important tool in digital signal processing. In this paper, a multilierless algorithm to compute discrete Hartley transforms is proposed, which can deal with arbitrary length input signals. The proposed algorithm can be implemented by integer additions of fixed points in binary system. Besides, an efficient and regular systolic array is designed to impleme...

متن کامل

A Circular Formulation of the Prime Length DHT Kernel and its FPGA Implementation

This paper presents an algorithm to convert the prime-length Discrete Hartley Transform (DHT) kernel into a circular form. Further, a hardware architecture, employing Distributed Arithmetic, and the circular formulation mentioned above, is designed and implemented on a Xilinx FPGA. Distributed Arithmetic is very useful in creating efficient FPGA implementations while cyclic convolution provides...

متن کامل

Novel Systolic Array Design for the Discrete Hartley Transform with High Throughput Rate

--In this paper, three attractive features for the DHT transform are derived, including (1)the Single/ Double Data Folding ; (2) the constructive feature and (3) the data reusage. By using CORDIC algorithm, The DHT Transform Kernel hm*[cose+ sine] and conjugate kernel h,*[cose-sln€I I can be simultanously determined. With these favorable properties, a novel systolic array design for the Discret...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000